coin-tossing problem

См. также в других словарях:

• Coin flipping — or coin tossing or heads or tails is the practice of throwing a coin in the air to choose between two alternatives, sometimes to resolve a dispute between two parties. It is a form of sortition which inherently has only two possible and equally… …   Wikipedia

• Urn problem — In statistics, an urn problem is an idealized thought experiment in which some objects of real interest (such as atoms, people, cars, etc.) are represented as colored balls in an urn or other container.One pretends to draw (remove) one or more… …   Wikipedia

• Dining cryptographers problem — In cryptography, the dining cryptographers problem studies how to perform a secure multi party computation of the boolean OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible …   Wikipedia

• Checking whether a coin is fair — In statistics, the question of checking whether a coin is fair is one whose importance lies, firstly, in providing a simple problem on which to illustrate basic ideas of statistical inference and, secondly, in providing a simple problem that can… …   Wikipedia

• Checking if a coin is fair — In statistics, a fair coin is an idealized randomizing device with two states (usually named heads and tails ) which are equally likely to occur. It is based on the ubiquitous coin flip used in sports and other situations where it is necessary to …   Wikipedia

• Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… …   Wikipedia

• Generalizations of Fibonacci numbers — In mathematics, the Fibonacci numbers form a sequence defined recursively by:: F (0) = 0: F (1) = 1: F ( n ) = F ( n 1) + F ( n 2), for integer n > 1.That is, after two starting values, each number is the sum of the two preceding numbers.The… …   Wikipedia

• Random walk — A random walk, sometimes denoted RW, is a mathematical formalization of a trajectory that consists of taking successive random steps. The results of random walk analysis have been applied to computer science, physics, ecology, economics and a… …   Wikipedia

• probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

• Optimal stopping — In mathematics, the theory of optimal stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of… …   Wikipedia

• Chess960 starting position — Chess960 is a chess variant in which the arrangement of pieces on the first rank is randomly generated. There are 960 possible starting positions, hence the name. The starting position can be generated before the game either by a computer program …   Wikipedia